Approximation algorithm

Results: 454



#Item
31Systems science / Mathematics / Image segmentation / Dynamic programming / Algorithm / Systems theory / Approximation algorithm / Time-series segmentation / Graph cuts in computer vision

Efficient algorithms for sequence segmentation Evimaria Terzi ∗ Panayiotis Tsaparas † The error in this approximate representation is measured using some error function, e.g. the sum of squares. Different

Add to Reading List

Source URL: www.cs.uoi.gr

Language: English - Date: 2006-01-26 11:38:44
32Graph theory / Mathematics / Operations research / Mathematical optimization / NP-complete problems / Dynamic programming / Equations / Systems engineering / Independent set / Interval scheduling / Interval graph / Approximation algorithm

1 Optimizing Busy Time on Parallel Machines George B. Mertzios∗ , Mordechai Shalom† , Ariella Voloshin‡ , Prudence W.H. Wong§ and Shmuel Zaks‡ ∗ School of Engineering and Computing Sciences, Durham University

Add to Reading List

Source URL: cgi.csc.liv.ac.uk

Language: English - Date: 2012-02-08 11:20:14
33Computational complexity theory / Mathematics / Theory of computation / Analysis of algorithms / Scheduling / Polynomial-time approximation scheme / Makespan / Time complexity / Partition / Randomized algorithm / Algorithm / Integral

Truthful Approximation Schemes for Single-Parameter Agents∗ Peerapong Dhangwatnotai† Shahar Dobzinski‡ Shaddin Dughmi§

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2011-05-11 07:37:06
34Graph theory / Mathematics / Computational complexity theory / NP-complete problems / Combinatorial optimization / Edsger W. Dijkstra / Spanning tree / Operations research / Shortest path problem / Graph / Linear programming / Steiner tree problem

A Constant-Factor Approximation Algorithm for the Multicommodity Rent-or-Buy Problem Amit Kumar ∗ Anupam Gupta†

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2004-09-21 15:30:36
35Mathematics / NP-complete problems / Theory of computation / Scheduling / Theoretical computer science / Combinatorial optimization / Independent set / Makespan / Approximation algorithm / Matching / Operations research / Truthful job scheduling

Anna Adamaszek, Andreas Wiese Tutorials: Marvin K¨ unnemann Summer 2014

Add to Reading List

Source URL: resources.mpi-inf.mpg.de

Language: English - Date: 2014-06-04 08:45:27
36Graph theory / Mathematics / Computational complexity theory / NP-complete problems / Steiner tree problem / XTR / Shortest path problem / Flow network / Maximum flow problem / Graph coloring

Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem Anupam Gupta∗ Amit Kumar†

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2004-09-21 15:30:39
37Mathematics / Operations research / Linear programming / Combinatorial optimization / Convex optimization / Submodular set function / Valuation / Approximation algorithm / Randomized rounding / Ellipsoid method / Mathematical optimization / Algorithm

CS364B: Frontiers in Mechanism Design Lecture #10: Coverage Valuations and Convex Rounding∗ Tim Roughgarden† February 5, 2014

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2014-06-11 16:25:54
38Mathematics / Mathematical analysis / Theory of computation / Combinatorial optimization / Matching / Linear programming / Approximation algorithm / Permutation / Measure theory / operator

Online Bipartite Matching with Random Arrivals: An Approach Based on Strongly Factor-Revealing LPs ∗ Mohammad Mahdian

Add to Reading List

Source URL: www.qiqiyan.com.s3-website-us-east-1.amazonaws.com

Language: English - Date: 2012-07-04 18:28:36
39Graph theory / Mathematics / Computational complexity theory / NP-complete problems / Combinatorial optimization / NP-hard problems / Approximation algorithms / Edsger W. Dijkstra / Travelling salesman problem / Nearest neighbour algorithm / Shortest path problem / Maximal independent set

Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems Karl Bringmann1 , Christian Engels2 , Bodo Manthey3 , B. V. Raghavendra Rao4 1 Max Planck Institute for Informatics, .d

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2016-01-03 06:46:12
40Computational complexity theory / Mathematics / Theory of computation / NP-complete problems / Operations research / Approximation algorithms / Combinatorial optimization / Set cover problem / Linear programming relaxation / Greedy algorithm / Facility location problem / Reduction

PASS Approximation: A Framework for Analyzing and Designing Heuristics Uriel Feige ∗† Nicole Immorlica ∗‡

Add to Reading List

Source URL: users.eecs.northwestern.edu

Language: English - Date: 2009-09-15 22:21:32
UPDATE